First order quantifiers in~monadic second order logic
نویسندگان
چکیده
This paper studies the expressive power that an extra first order quantifier adds to a fragment of monadic second order logic, extending the toolkit of Janin and Marcinkowski [JM01]. We introduce an operation existsn(S) on properties S that says “there are n components having S”. We use this operation to show that under natural strictness conditions, adding a first order quantifier word u to the beginning of a prefix class V increases the expressive power monotonically in u. As a corollary, if the first order quantifiers are not already absorbed in V , then both the quantifier alternation hierarchy and the existential quantifier hierarchy in the positive first order closure of V are strict. Wegeneralize and simplifymethods fromMarcinkowski [Mar99] to uncover limitations of the expressive power of an additional first order quantifier, and show that for a wide class of properties S, S cannot belong to the positive first order closure of a monadic prefix classW unless it already belongs toW . We introduce another operation alt(S) on properties which has the same relationship with the Circuit Value Problem as reach(S) (defined in [JM01]) has with the Directed Reachability Problem. We use alt(S) to show that Πn 6⊆ FO(Σn), Σn 6⊆ FO(∆n), and ∆n+1 6⊆ FOB(Σn), solving some open problems raised
منابع مشابه
The hierarchy inside closed monadic Σ1 collapses on the infinite binary tree
Closed monadic Σ1, as proposed in [AFS98], is the existential monadic second order logic where alternation between existential second order quantifiers and first order quantifiers is allowed. Despite some effort very little is known about the expressive power of this logic on finite structures. We construct a tree automaton which exactly characterizes closed monadic Σ1 on the Rabin tree and giv...
متن کاملTowards Elimination of Second-Order Quantifiers in the Separated Fragment
It is a classical result that the monadic fragment of secondorder logic admits elimination of second-order quantifiers. Recently, the separated fragment (SF) of first-order logic has been introduced. SF generalizes the monadic first-order fragment without equality, while preserving decidability of the satisfiability problem. Therefore, it is a natural question to ask whether SF also admits elim...
متن کاملCharacterizing Definability of Second-Order Generalized Quantifiers
We study definability of second-order generalized quantifiers. We show that the question whether a second-order generalized quantifier Q1 is definable in terms of another quantifier Q2, the base logic being monadic second-order logic, reduces to the question if a quantifier Q1 is definable in FO(Q2, <,+,×) for certain first-order quantifiers Q1 and Q2. We use our characterization to show new de...
متن کاملLimited Set quantifiers over Countable Linear Orderings
In this paper, we study several sublogics of monadic secondorder logic over countable linear orderings, such as first-order logic, firstorder logic on cuts, weak monadic second-order logic, weak monadic second-order logic with cuts, as well as fragments of monadic secondorder logic in which sets have to be well ordered or scattered. We give decidable algebraic characterizations of all these log...
متن کاملThe Downward Transfer of Elementary Satisfiability of Partition Logics
The following operation has frequently occurred in mathematics and its applications: partition a set into several disjoint non-empty subsets, so that the elements in each partition subset are homogeneous or indistinguishable with respect to some given properties. H.-D.Ebbinghaus first (in 1991) distilled from this phenomenon, which is a monadic second order property in nature, a special kind of...
متن کاملCounting Proportions of Sets: Expressive Power with Almost Order
We present a second order logic of proportional quantifiers, SOLP, which is essentially a first order language extended with quantifiers that act upon second order variables of a given arity r, and count the fraction of elements in a subset of r–tuples of a model that satisfy a formula. Our logic is capable of expressing proportional versions of different problems of complexity up to NP-hard, a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Symb. Log.
دوره 69 شماره
صفحات -
تاریخ انتشار 2004